Maximum Cellular Boolean Functions and Perfect Gray Codes
نویسنده
چکیده
I. A Boolean function of n variables, considered as a subset of t he discl'cLe uni t n-cube Bn> is called cellular if each of its connected components is a face of Bn. Hammin g'~ determination of optimal binary single-error-detectin g codes is generalized to a characteri zation of all propel' cellular functions with the greatest possible number of clements . II. An analysis is made of a class of Gray codes (H amiltonian circuits on Bn) with certain special propcrti es, e.g., ad mi tting for O:Sd:Sn a parti tion in to 2n d subpaths eac h formin g a d-c1 imensional face of Bn.
منابع مشابه
Binary linear codes from vectorial boolean functions and their weight distribution
Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary linear codes from vectorial Boolean functions and determine their parameters, by further studying a generic construction developed by Ding et al. recently. Fir...
متن کاملA new large class of functions not APN infinitely often
In this paper, we show that there is no vectorial Boolean function of degree 4e, with e satisfaying certain conditions, which is APN over infinitely many extensions of its field of definition. It is a new step in the proof of the conjecture of Aubry, McGuire and Rodier. Vectorial Boolean function and Almost Perfect Non-linear functions and Algebraic surface and CCZ equivalence
متن کاملBasic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of annihilator immunity. This construction provides functions with the maximum possible annihilator immunity and the weight, nonlinearity and algebraic degree of the functions can be properly calculated under certain cas...
متن کاملOn Self-Dual Quantum Codes, Graphs, and Boolean Functions
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond ...
متن کاملCombinatorially Based Cryptography for Children and Adults
In this paper we show how certain notions of modern cryptogra phy can be presented to youngsters using combinatorial constructions Among the topics discussed are the use of Boolean circuits for bit com mitment protocols and hash functions and the construction of a public key message transmission system using perfect codes in a graph We also discuss how e orts such as this in popularizing mathem...
متن کامل